The Optimal Online Algorithms for Minimizing Maximum Lateness
نویسنده
چکیده
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arrive over time on a single machine to minimize maximum lateness. It was not previously known what other online algorithms are optimal for this problem. A complete characterization of all optimal online algorithms for this problem is given.
منابع مشابه
Solving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملAlgorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints
Blazewicz, J., W. Kubiak and S. Martello, Algorithms for minimizing maximum lateness with unit length tasks and resource constraints, Discrete Applied Mathematics 42 (1993) 1233138. The problem we consider is that of scheduling n unit length tasks on identical processors in the presence of additional scarce resources. The objective is to minimize maximum lateness. It has been known for some tim...
متن کاملAn Optimal Incremental Algorithm for Minimizing Lateness with Rejection
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what order should they be processed on a single machine to minimize maximum lateness? The lateness of a job is defined as its completion time minus its due date. This problem can be solved easily by ordering the jobs in non...
متن کاملScheduling on uniform parallel machines to minimize maximum lateness
We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملOne-Operator, Two-Machine Open Shop and Flow Shop Scheduling with Setup Times for Machines and Maximum Lateness Objective
This paper considers a scheduling problem in which a single operator completes a set of n jobs requiring operations on two machines. The operator can perform only one operation at a time, so when one machine is in use the other is idle. After developing general properties of optimal schedules, the paper develops e cient algorithms for minimizing maximum lateness. The algorithm has time complexi...
متن کامل